Tootfinder

Der paradoxe ÖPNV-Streik von Verdi
Freitag fahren fast keine Straßenbahnen und Busse. Dabei streikt Verdi angeblich, um die Qualität des Nahverkehrs zu verbessern. Sie treffen Pendler und Schülerinnen. Dabei hat die Gewerkschaft in der Sache Recht.
https://rp-online.de/w…

ÖVPN Streik NRW am Freitag: Alles reichlich seltsam
Freitag fahren fast keine Straßenbahnen und Busse. Dabei streikt Verdi angeblich, um die Qualität des Nahverkehrs zu verbessern. Sie treffen Pendler und Schülerinnen. Dabei hat die Gewerkschaft in der Sache recht.

Scalable, Interpretable Distributed Protocol Verification by Inductive Proof Slicing
William Schultz, Edward Ashton, Heidi Howard, Stavros Tripakis
https://arxiv.org/abs/2404.18048

Scalable, Interpretable Distributed Protocol Verification by Inductive Proof Slicing
Many techniques for automated inference of inductive invariants for distributed protocols have been developed over the past several years, but their performance can still be unpredictable and their failure modes opaque for large-scale verification tasks. In this paper, we present inductive proof slicing, a new automated, compositional technique for inductive invariant inference that scales effectively to large distributed protocol verification tasks. Our technique is built on a core, novel data…

VerifiNER: Verification-augmented NER via Knowledge-grounded Reasoning with Large Language Models
Seoyeon Kim, Kwangwook Seo, Hyungjoo Chae, Jinyoung Yeo, Dongha Lee
https://arxiv.org/abs/2402.18374

VerifiNER: Verification-augmented NER via Knowledge-grounded Reasoning with Large Language Models
Recent approaches in domain-specific named entity recognition (NER), such as biomedical NER, have shown remarkable advances. However, they still lack of faithfulness, producing erroneous predictions. We assume that knowledge of entities can be useful in verifying the correctness of the predictions. Despite the usefulness of knowledge, resolving such errors with knowledge is nontrivial, since the knowledge itself does not directly indicate the ground-truth label. To this end, we propose VerifiNE…

This https://arxiv.org/abs/2303.00872 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Phase transition in a periodic tubular structure
We consider an $\varepsilon$-periodic ($\varepsilon\to 0$) tubular structure, modelled as a magnetic Laplacian on a metric graph, which is periodic along a single axis. We show that the corresponding Hamiltonian admits norm-resolvent convergence to an ODE on $\mathbb{R}$ which is fourth order at a discrete set of values of the magnetic potential (\emph{critical points}) and second-order generically. In a vicinity of critical points we establish a mixed-order asymptotics. The rate of convergence…

Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
https://arxiv.org/abs/2403.18591 https:…

Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
We study networks of processes that all execute the same finite protocol and communicate synchronously in two different ways: a process can broadcast one message to all other processes or send it to at most one other process. In both cases, if no process can receive the message, it will still be sent. We establish a precise complexity class for two coverability problems with a parameterised number of processes: the state coverability problem and the configuration coverability problem. It is alr…

#TGIQF: Good Bye, Z80! Das Quiz rund um den legendären 8-Bit-Prozessor
Der Z80-Prozessor, eine der wichtigsten 8-Bit-CPUs, wird nach fast 50 Jahren Produktion eingestellt. Wir verabschieden uns mit einem kleinen Quiz.

RF-Flashlight Testbed for Verification of Real-Time Geofencing of EESS Radiometers and Millimeter-Wave Ground-to-Satellite Propagation Models
Elliot Eichen, Arvind Aradhya, Ljiljana Simi\'c
https://arxiv.org/abs/2402.18456

RF-Flashlight Testbed for Verification of Real-Time Geofencing of EESS Radiometers and Millimeter-Wave Ground-to-Satellite Propagation Models
A simple 'RF-flashlight' (or ground to satellite) interference testbed is proposed to experimentally verify real-time geofencing (RTG) for protecting passive Earth Exploration Satellite Services (EESS) radiometer measurements from 5G or 6G mm-wave transmissions, and ground to satellite propagation models used in the interference modeling of this spectrum coexistence scenario. RTG is a stronger EESS protection mechanism than the current methodology recommended by the ITU based on a worst-case in…

Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
https://arxiv.org/abs/2403.18591 https:…

Safety Verification of Wait-Only Non-Blocking Broadcast Protocols
We study networks of processes that all execute the same finite protocol and communicate synchronously in two different ways: a process can broadcast one message to all other processes or send it to at most one other process. In both cases, if no process can receive the message, it will still be sent. We establish a precise complexity class for two coverability problems with a parameterised number of processes: the state coverability problem and the configuration coverability problem. It is alr…

Automata-Theoretic Characterisations of Branching-Time Temporal Logics
Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron
https://arxiv.org/abs/2404.17421

Automata-Theoretic Characterisations of Branching-Time Temporal Logics
Characterisations theorems serve as important tools in model theory and can be used to assess and compare the expressive power of temporal languages used for the specification and verification of properties in formal methods. While complete connections have been established for the linear-time case between temporal logics, predicate logics, algebraic models, and automata, the situation in the branching-time case remains considerably more fragmented. In this work, we provide an automata-theoreti…

This https://arxiv.org/abs/2402.14485 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Machine-Checked Categorical Diagrammatic Reasoning
This paper describes a formal proof library, developed using the Coq proof assistant, designed to assist users in writing correct diagrammatic proofs, for 1-categories. This library proposes a deep-embedded, domain-specific formal language, which features dedicated proof commands to automate the synthesis, and the verification, of the technical parts often eluded in the literature.